Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images

Segmentations of a digital object based on a connectivity criterion at n-xel or sub-n-xel level are useful tools in image topological analysis and recognition. Working with cell complex analogous of digital objects, an example of this kind of segmentation is that obtained from the combinatorial representation so called Homological Spanning Forest (HSF, for short) which, informally, classifies the cells of the complex as belonging to regions containing the maximal number of cells sharing the same homological (algebraic homology with coefficient in a field) information. We design here a parallel method for computing a HSF (using homology with coefficients in Z/2Z) of a 3D digital object. If this object is included in a 3D image of m1 × m2 × m3 voxels, its theoretical time complexity order is near O(log(m1 + m2 + m3)), under the assumption that a processing element is available for each voxel. A prototype implementation validating our results has been written and several synthetic, random and medical tridimensional images have been used for testing. The experiments allow us to assert that the number of iterations in which the homological information is found varies only to a small extent from the theoretical computational time.Ministerio de Economía y Competitividad MTM2016-81030-

Photonic quantum technologies

The first quantum technology, which harnesses uniquely quantum mechanical effects for its core operation, has arrived in the form of commercially available quantum key distribution systems that achieve enhanced security by encoding information in photons such that information gained by an eavesdropper can be detected. Anticipated future quantum technologies include large-scale secure networks, enhanced measurement and lithography, and quantum information processors, promising exponentially greater computation power for particular tasks. Photonics is destined for a central role in such technologies owing to the need for high-speed transmission and the outstanding low-noise properties of photons. These technologies may use single photons or quantum states of bright laser beams, or both, and will undoubtably apply and drive state-of-the-art developments in photonics

A scalable expressive ensemble learning using Random Prism: a MapReduce approach

The induction of classification rules from previously unseen examples is one of the most important data mining tasks in science as well as commercial applications. In order to reduce the influence of noise in the data, ensemble learners are often applied. However, most ensemble learners are based on decision tree classifiers which are affected by noise. The Random Prism classifier has recently been proposed as an alternative to the popular Random Forests classifier, which is based on decision trees. Random Prism is based on the Prism family of algorithms, which is more robust to noise. However, like most ensemble classification approaches, Random Prism also does not scale well on large training data. This paper presents a thorough discussion of Random Prism and a recently proposed parallel version of it called Parallel Random Prism. Parallel Random Prism is based on the MapReduce programming paradigm. The paper provides, for the first time, novel theoretical analysis of the proposed technique and in-depth experimental study that show that Parallel Random Prism scales well on a large number of training examples, a large number of data features and a large number of processors. Expressiveness of decision rules that our technique produces makes it a natural choice for Big Data applications where informed decision making increases the user’s trust in the system

A note on the O(n)-storage implementation of the GKO algorithm

We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems with Cauchy-like matrix. Despite its slightly higher computational cost, this new algorithm makes a more efficient use of the processor cache memory. Thus, for matrices of size larger than about 500-1000, it outperforms the existing algorithms. We present an applicative case of Cauchy-like matrices with non-reconstructible main diagonal. In this special instance, the O(n) space algorithms can be adapted nicely to provide an efficient implementation of basic linear algebra operations in terms of the low displacement-rank generators

ccTSA: A Coverage-Centric Threaded Sequence Assembler

De novo sequencing, a process to find the whole genome or the regions of a species without references, requires much higher computational power compared to mapped sequencing with references. The advent and continuous evolution of next-generation sequencing technologies further stress the demands of high-throughput processing of myriads of short DNA fragments. Recently announced sequence assemblers, such as Velvet, SOAPdenovo, and ABySS, all exploit parallelism to meet these computational demands since contemporary computer systems primarily rely on scaling the number of computing cores to improve performance. However, most of them are not tailored to exploit the full potential of these systems, leading to suboptimal performance. In this paper, we present ccTSA, a parallel sequence assembler that utilizes coverage to prune k-mers, find preferred edges, and resolve conflicts in preferred edges between k-mers. We minimize computation dependencies between threads to effectively parallelize k-mer processing. We also judiciously allocate and reuse memory space in order to lower memory usage and further improve sequencing speed. The results of ccTSA are compelling such that it runs several times faster than other assemblers while providing comparable quality values such as N50

Ultrafast all-optical switching by single photons

An outstanding goal in quantum optics is the realization of fast optical non-linearities at the single-photon level. Such non-linearities would allow for the realization of optical devices with new functionalities such as a single-photon switch/transistor or a controlled-phase gate, which could form the basis of future quantum optical technologies. While non-linear optics effects at the single-emitter level have been demonstrated in different systems, including atoms coupled to Fabry-Perot or toroidal micro-cavities, super-conducting qubits in strip-line resonators or quantum dots (QDs) in nano-cavities, none of these experiments so far has demonstrated single-photon switching on ultrafast timescales. Here, we demonstrate that in a strongly coupled QD-cavity system the presence of a single photon on one of the fundamental polariton transitions can turn on light scattering on a transition from the first to the second Jaynes-Cummings manifold with a switching time of 20 ps. As an additional device application, we use this non-linearity to implement a single-photon pulse-correlator. Our QD-cavity system could form the building-block of future high-bandwidth photonic networks operating in the quantum regime

Higher-order multipole amplitudes in charmonium radiative transitions

Using 24 million $\psi' \equiv \psi(2S)$ decays in CLEO-c, we have searched for higher multipole admixtures in electric-dipole-dominated radiative transitions in charmonia. We find good agreement between our data and theoretical predictions for magnetic quadrupole (M2) amplitudes in the transitions $\psi' \to \gamma \chi_{c1,2}$ and $\chi_{c1,2} \to \gamma J/\psi$, in striking contrast to some previous measurements. Let $b_2^J$ and $a_2^J$ denote the normalized M2 amplitudes in the respective aforementioned decays, where the superscript $J$ refers to the angular momentum of the $\chi_{cJ}$. By performing unbinned maximum likelihood fits to full five-parameter angular distributions, we determine the ratios $a_2^{J=1}/a_2^{J=2} = 0.67^{+0.19}_{-0.13}$ and $a_2^{J=1}/b_2^{J=1} = -2.27^{+0.57}_{-0.99}$, where the theoretical predictions are independent of the charmed quark magnetic moment and are $a_2^{J=1}/a_2^{J=2} = 0.676 \pm 0.071$ and $a_2^{J=1}/b_2^{J=1} = -2.27 \pm 0.16$.Comment: 32 pages, 7 figures, acceptance updat

Dalitz Plot Analysis of Ds to K+K-pi+

We perform a Dalitz plot analysis of the decay Ds to K+K-pi+ with the CLEO-c data set of 586/pb of e+e- collisions accumulated at sqrt(s) = 4.17 GeV. This corresponds to about 0.57 million D_s+D_s(*)- pairs from which we select 14400 candidates with a background of roughly 15%. In contrast to previous measurements we find good agreement with our data only by including an additional f_0(1370)pi+ contribution. We measure the magnitude, phase, and fit fraction of K*(892) K+, phi(1020)pi+, K0*(1430)K+, f_0(980)pi+, f_0(1710)pi+, and f_0(1370)pi+ contributions and limit the possible contributions of other KK and Kpi resonances that could appear in this decay.Comment: 21 Pages,available through http://www.lns.cornell.edu/public/CLNS/, submitted to PR

Search for D0 to p e- and D0 to pbar e+

Using data recorded by CLEO-c detector at CESR, we search for simultaneous baryon and lepton number violating decays of the D^0 meson, specifically, D^0 --> p-bar e^+, D^0-bar --> p-bar e^+, D^0 --> p e^- and D^0-bar --> p e^-. We set the following branching fraction upper limits: D^0 --> p-bar e^+ (D^0-bar --> p-bar e^+) p e^- (D^0-bar --> p e^-) < 1.2 * 10^{-5}, both at 90% confidence level.Comment: 10 pages, available through http://www.lns.cornell.edu/public/CLNS/, submitted to PRD. Comments: changed abstract, added reference for section 1, vertical axis in Fig.5 changed (starts from 1.5 rather than 2.0), fixed typo